Revisiting convexity-preserving signal recovery with the linearly involved GMC penalty

نویسندگان

چکیده

• A new method for setting the matrix parameter in linearly involved GMC is proposed. An alternative algorithm presented to solve linear convexity-preserving model. Two properties of solution path are proved help with tuning selection. The generalized minimax concave (GMC) penalty a newly proposed regularizer that can maintain convexity objective function. This paper deals signal recovery penalty. First, we propose set via solving feasibility problem. possesses appealing advantages over existing method. Second, recast model as saddle-point problem and use primal-dual hybrid gradient (PDHG) compute solution. Another important work this provide guidance on selection by proving desirable path. Finally, apply 1-D regression. Numerical results show obtain better performance preserve structure more successfully comparison total variation (TV) regularizer.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convexity preserving interpolatory subdivision with conic precision

The paper is concerned with the problem of shape preserving interpolatory subdivision. For arbitrarily spaced, planar input data an efficient non-linear subdivision algorithm reproducing conic sections and respecting the convexity properties of the initial data, is here presented. Significant numerical examples are included to illustrate the effectiveness of the proposed method and the smoothne...

متن کامل

Convexity preserving splines over triangulations

A general method is given for constructing sets of sufficient linear conditions that ensure convexity of a polynomial in Bernstein–Bézier form on a triangle. Using the linear conditions, computational methods based on macro-element spline spaces are developed to construct convexity preserving splines over triangulations that interpolate or approximate given scattered data.

متن کامل

An Algorithm for Splitting Parallel Sums of Linearly Composed Monotone Operators, with Applications to Signal Recovery∗

We present a new primal-dual splitting algorithm for structured monotone inclusions in Hilbert spaces and analyze its asymptotic behavior. A novelty of our framework, which is motivated by image recovery applications, is to consider inclusions that combine a variety of monotonicitypreserving operations such as sums, linear compositions, parallel sums, and a new notion of parallel composition. T...

متن کامل

Convexity - Preserving Scattered Data Interpolation 33 2 . 3 Convexity Conditions

This study deals with constructing a convexity-preserving bivariate C interpolants to scattered data whenever the original data are convex. Sufficient conditions on lower bound of Bézier points are derived in order to ensure that surfaces comprising cubic Bézier triangular patches are always convex and satisfy C continuity conditions. Initial gradients at the data sites are estimated and then m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pattern Recognition Letters

سال: 2022

ISSN: ['1872-7344', '0167-8655']

DOI: https://doi.org/10.1016/j.patrec.2022.02.004